Deciding the Borel Complexity of Regular Tree Languages
نویسندگان
چکیده
We show that it is decidable whether a given a regular tree language belongs to the class ∆2 of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.
منابع مشابه
Deciding the Topological Complexity of Büchi Languages
We study the topological complexity of languages of Büchi automata on infinite binary trees. We show that such a language is either Borel and WMSO-definable, or Σ1-complete and not WMSO-definable; moreover it can be algorithmically decided which of the two cases holds. The proof relies on a direct reduction to deciding the winner in a finite game with a regular winning condition. 1998 ACM Subje...
متن کاملAn upper bound on the complexity of recognizable tree languages
The third author noticed in his 1992 PhD Thesis [Sim92] that every regular tree language of infinite trees is in a class a(Dn(Σ2)) for some natural number n ≥ 1, where a is the game quantifier. We first give a detailed exposition of this result. Next, using an embedding of the Wadge hierarchy of non self-dual Borel subsets of the Cantor space 2 into the class ∆2, and the notions of Wadge degree...
متن کاملOn the Borel Complexity of MSO Definable Sets of Branches
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow some extra monadic predicates on the nodes. We show that this class equals to the Boolean combinations of sets in the Borel class Σ 2 over the Cantor discontinuum. Note that the last coincides with the Borel complexit...
متن کاملState Complexity of Regular Tree Languages for Tree Pattern Matching
We study the state complexity of regular tree languages for tree matching problem. Given a tree t and a set of pattern trees L, we can decide whether or not there exists a subtree occurrence of trees in L from the tree t by considering the new language L′ which accepts all trees containing trees in L as subtrees. We consider the case when we are given a set of pattern trees as a regular tree la...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کامل